Krylov Methods for Solving Models Withforward - Looking Variables 1
نویسنده
چکیده
The simulation of large macroeconometric models containing forward-looking variables can become impractical when using exact Newton methods. The diiculties generally arise from the use of direct methods for the solution of the linear system in the Newton step. In such cases, nonstationary iterative methods, also called Krylov methods, provide an interesting alternative. In this paper we apply such methods to simulate a real world econometric model. Our numerical experiments connrm the interesting features of these techniques: low computational complexity and storage requirements. We also discuss a block preconditioner suitable for the particular class of models solved.
منابع مشابه
Solving large systems arising from fractional models by preconditioned methods
This study develops and analyzes preconditioned Krylov subspace methods to solve linear systems arising from discretization of the time-independent space-fractional models. First, we apply shifted Grunwald formulas to obtain a stable finite difference approximation to fractional advection-diffusion equations. Then, we employee two preconditioned iterative methods, namely, the preconditioned gen...
متن کاملParallel Algorithms for Large Scale Macroeconometric Models
Macroeconometric models with forward-looking variables give raise to very large systems of equations that requires heavy computations. These models was influenced by the development of new and efficient computational techniques and they are an interesting testing ground for the numerical methods addressed in this research. The most difficult problem in solving such models is to obtain the solut...
متن کاملParallel Krylov Methods for Econometric Model Simulation
This paper investigates parallel solution methods to simulate large-scale macroeconometric models with forward-looking variables. The method chosen is the Newton-Krylov algorithm. We concentrate on a parallel solution to the sparse linear system arising in the Newton algorithm, and we empirically analyze the scalability of the GMRES method, which belongs to the class of so-called Krylov subspac...
متن کاملNew variants of the global Krylov type methods for linear systems with multiple right-hand sides arising in elliptic PDEs
In this paper, we present new variants of global bi-conjugate gradient (Gl-BiCG) and global bi-conjugate residual (Gl-BiCR) methods for solving nonsymmetric linear systems with multiple right-hand sides. These methods are based on global oblique projections of the initial residual onto a matrix Krylov subspace. It is shown that these new algorithms converge faster and more smoothly than the Gl-...
متن کاملA Rational Krylov Iteration for Optimal H2 Model Reduction
In the sequel, we will construct the reduced order models Gr(s) through Krylov projection methods. Toward this end, we construct matrices V ∈ R and Z ∈ R that span certain Krylov subspaces with the property that Z V = Ir. The reduced order model Gr(s) will then be obtained as Ar = Z T AV, Br = Z T B, and Cr = CV. (2) The corresponding oblique projection is given by V Z . Many researchers have w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998